War Size Distribution: Empirical Regularities Behind Conflicts

This paper analyses the statistical distribution of war sizes. Using a new methodology we find moderate support for a Pareto-type distribution (power law), considering data from different sources (COW and UCDP) and periods. A power law is a plausible model for the size distribution of a pool of all wars and a sample of wars in many years, although the log-normal distribution is a plausible alternative model that we cannot reject. The random growth of conflicts could generate both types of distribution. We study the growth rates of battle deaths and random growth cannot be rejected for most of the distribution, although the results also reveal a clear decreasing pattern; the growth of deaths declines faster if the number of initial deaths is greater.     

Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models

In this article, we study a biobjective economic lot‐sizing problem with applications, among others, in green logistics. The first objective aims to minimize the total lot‐sizing costs including production and inventory holding costs, whereas the second one minimizes the maximum production and inventory block expenditure. We derive (almost) tight complexity results for the Pareto efficient outcome problem under nonspeculative lot‐sizing costs. First, we identify nontrivial problem classes for which this problem is polynomially solvable. Second, if we relax any of the parameter assumptions, we show that (except for one case) finding a single Pareto efficient outcome is an ‐hard task in general. Finally, we shed some light on the task of describing the Pareto frontier. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 386–402, 2014     

信息中心网络缓存节点位置选择算法

信息中心网络（Information-Centric Networking, ICN）“泛在缓存”的特性，引发数据副本率过高、缓存空间不能充分利用等问题。为了解决上述问题，分别从用户、服务提供商和网络运营商的角度出发，以最小化网络流量与网络费用开销为优化目标建立两个单目标优化模型，并将二者结合为帕累托模型；基于帕累托求解方法中数学规划法的思想，详细描述缓存节点位置选择算法。仿真结果表明：在流量性价比方面，所提缓存节点选择算法优于ICN的默认缓存机制；在网络费用开销方面，所提算法更适用于只有少数内容较为流行的网络中，而在所有内容都流行的情况下，ICN中默认的“遍地缓存”机制更为适宜。     

接敌前基于D-S理论的空战意图预测

接敌前是指敌机刚进入我方预警系统的探测范围(一般为400 km),并截获敌机,获得了敌机的运动参数,对敌机进行实时跟踪。为了完成对敌机目标意图的预测,为接敌前的自主决策打下基础,在D-S证据理论的基础上,选取合适的态势元素,分析各态势元素对敌机意图的影响,建立了目标意图预测模型,该模型具有一定的表达性和准确性。仿真实验表明,使用该模型能在敌机相距较远时以一定的准确性判断敌机的意图,实用性强,为接敌前基于意图预测的自主决策留出足够的时间。     

空陆攻防博弈的动态武器目标分配

大规模作战具有高动态、非完全信息和不确定性，在分析归纳目前解决动态武器目标分配问题的一系列方法的基础上，尝试构建基于双方动态博弈的攻防对抗综合数学模型，并利用纳什均衡和帕累托最优算法进行分阶段求解。结果表明，该数学模型和博弈论方法结合能够有效解决武器目标动态分配问题。     

晚唐的美丽智慧的芳香——浅析“前线诗人”的无题诗

20世纪30年代，在北平的现代派诗人群体中，被评论家李健吾称作“前线诗人”的废名、林庚、卞之琳、何其芳等曾掀起一股“晚唐诗热”，对中国诗歌传统进行了一次独到的重新发掘与阐释。无独有偶，在这些少数的前线诗人中，废名、林庚、卞之琳都曾不约而同写下了若干无题诗，对应晚唐李商隐的无题诗，他们在自由表现其诗的感觉与理想中亦见出了他们的不同个性与智慧。     

无产阶级军事家与“高树勋运动”的兴起

毛泽东、朱德、邓小平等无产阶级军事家对“高树勋运动”在解放战争时期的兴起作出了各自的贡献：邓小平通过做争取高树勋的统战工作，为“高树勋运动”兴起创造出实践经验，树立起实践典型；毛泽东发出“开展高树勋运动”的号召，要求全军广泛“开展高树勋运动”；朱德则把“高树勋运动”提高到符合历史规律的理论高度作出肯定。     

基于图像拼接技术的电子对景图制作技术?

针对当前对景图制作存在的问题，提出了一种基于图像拼接技术的电子对景图的制作技术，该技术采用SIFT算法提取海区图像的特征点，使用RANSAC算法对特征点进行精确提纯，最后使用加权平均法实现图像的平滑过渡。实验表明该技术可实现海区图像的无缝拼接，真实感强。     

交互式Pareto前沿可视化决策

针对现有高维多目标可视化技术不能有效显示决策偏好信息这一难题,提出一种基于径向轴图的交互式Pareto前沿可视化决策方法。进行标准化适应度函数处理,消除量纲差距;根据交互更新的轴向量矩阵建立最小二乘问题模型,通过Moore-Penrose广义逆矩阵方法求解投影点,从而获得Pareto前沿分布图。该方法能够有效显示目标各维度信息,直观呈现决策偏好,动态表现目标性能趋势。通过实验与传统可视化技术对比分析,验证了该方法的有效性和实用性。     

Consecutive k‐within‐m‐out‐of‐n:F system with exchangeable components

As a generalization of k‐out‐of‐n:F and consecutive k‐out‐of‐n:F systems, the consecutive k‐within‐m‐out‐of‐n:F system consists of n linearly ordered components such that the system fails iff there are m consecutive components which include among them at least k failed components. In this article, the reliability properties of consecutive k‐within‐m‐out‐of‐n:F systems with exchangeable components are studied. The bounds and approximations for the survival function are provided. A Monte Carlo estimator of system signature is obtained and used to approximate survival function. The results are illustrated and numerics are provided for an exchangeable multivariate Pareto distribution. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009